Newman Polynomials Not Vanishing on the Unit Circle

نویسنده

  • Idris Mercer
چکیده

A Newman polynomial is a polynomial in one variable whose coefficients are 0 or 1, and the length of a Newman polynomial is the number of coefficients that are 1. Several authors have asked about the highest minimum modulus of a length n Newman polynomial on the unit circle, but there remains a large gap between what has been conjectured and what has been proved. In this paper, we prove that for each n > 2, there is a length n Newman polynomial with no roots on the unit circle.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Newman Polynomials, Reducibility, and Roots on the Unit Circle

A length k Newman polynomial is any polynomial of the form za1 + · · ·+zak (where a1 < · · · < ak). Some Newman polynomials are reducible over the rationals, and some are not. Some Newman polynomials have roots on the unit circle, and some do not. Defining, in a natural way, what we mean by the “proportion” of length k Newman polynomials with a given property, we prove that • 1/4 of length 3 Ne...

متن کامل

Some new families of definite polynomials and the composition conjectures

The planar polynomial vector fields with a center at the origin can be written as an scalar differential equation, for example Abel equation. If the coefficients of an Abel equation satisfy the composition condition, then the Abel equation has a center at the origin. Also the composition condition is sufficient for vanishing the first order moments of the coefficients. The composition conjectur...

متن کامل

Coppersmith-rivlin Type Inequalities and the Order of Vanishing of Polynomials at 1

for every n ≥ 2, where Fn denotes the set of all polynomials of degree at most n with coefficients from {−1, 0, 1}. Littlewood considered minimization problems of this variety on the unit disk. His most famous, now solved, conjecture was that the L1 norm of an element f ∈ Fn on the unit circle grows at least as fast as c logN , where N is the number of non-zero coefficients in f and c > 0 is an...

متن کامل

Barker Sequences and Flat Polynomials

A Barker sequence is a finite sequence of integers, each ±1, whose aperiodic autocorrelations are all as small as possible. It is widely conjectured that only finitely many Barker sequences exist. We describe connections between Barker sequences and several problems in analysis regarding the existence of polynomials with ±1 coefficients that remain flat over the unit circle according to some cr...

متن کامل

The Mahler Measure of the Rudin-shapiro Polynomials

Littlewood polynomials are polynomials with each of their coefficients in {−1, 1}. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro polynomials. It is shown in this paper that the Mahler measure and the maximum modulus of the Rudin-Shapiro polynomials on the unit circle of the complex plane h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012